TRE+: Extended Tree-Based Routing Ethernet
نویسندگان
چکیده
منابع مشابه
Multi-Priority Frame Forwarding in Tree-Based Routing Ethernet
Local area network (LAN) technology is extensively employed in backbones and campus networks due to its excellent price/performance ratio and its installation convenience. However, with the increasing demand for multimedia and real-time applications, LAN requires additional operations to support Quality-of-Service (QoS). In this paper, we propose a novel bridge protocol that can forward frames ...
متن کاملExtended shortcut tree routing for ZigBee based wireless sensor network
Energy efficiency and network lifetime are main concerns in WSN. In order to improve these factors ZigBee plays an important role. Low cost, low data rate features of ZigBee results in low power consumption and makes it useful in wireless sensor networks, increasing life of small batteries of nodes in the network. Since tree routing in ZigBee does not require any routing tables to send the pack...
متن کاملEthernet Fabric Routing (UETS/EFR)
In this paper we shall try to answer a fundamental question: how to build the Next Generation Network without disruption. The TCP/IP protocol stack has performance limits and the transparent bridge paradigm of Ethernets is complex to scale by lack of addressing hierarchy. To provide both full scalability and high performance, a new Ethernet switching architecture named Universal Ethernet Teleco...
متن کاملAdaptive Gossip - based Routing Algorithm ( Extended
Gossip-based techniques recently adopted in mobile ad hoc network (MANET) system have achieved significant improvement on network overhead, routing efficiency and reliability. In this paper we investigate an up-to-date gossip-based Ad Hoc routing algorithm (AODV+G) [2] implemented in Ad Hoc On-Demand Distance Vector Routing (AODV) and discuss its weakness with respect to overall network routing...
متن کاملRound-Based Public Transit Routing (Extended Abstract)
We study the problem of computing best connections in public transit networks. A common approach models the network as a graph (Pyrga et al. 2008) on which it runs a shortest path algorithm (Dijkstra 1959). To enable interactive queries, a variety of speedup techniques exist that use a preprocessing stage to accelerate queries (Delling et al. 2009; Bast et al. 2010). Unfortunately, developed wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETRI Journal
سال: 2010
ISSN: 1225-6463
DOI: 10.4218/etrij.10.0209.0388